On Improving Kd Tree for Ray Shooting
نویسندگان
چکیده
Efficient ray shooting algorithm is inherently required by many computer graphics algorithms, particularly in image synthesis. Practical ray shooting algorithms aiming at the average-case complexity use some underlying spatial data structure such as kd-tree. We show the new termination criteria algorithm that improves the space and time complexity of the kd-tree construction. It provides efficient ray-shooting queries and does not require any specific constants from a user. Further, we show how to apply a novel clipping algorithm into the kd-tree within construction phase in order to improve its properties.
منابع مشابه
DISSERTATION THESIS Heuristic Ray Shooting Algorithms
Global illumination research aiming at the photo-realistic image synthesis pushes forward research in computer graphics as a whole. The computation of visually plausible images is time-consuming and far from being realtime at present. A significant part of computation in global illumination algorithms involves repetitive computing of visibility queries. In the thesis, we describe our results in...
متن کاملFast Rcs Prediction Using Multiresolution Shooting and Bouncing Ray Method on the Gpu
This paper presents a GPU-based multiresolution shooting and bouncing ray (MSBR) method with the kd-tree acceleration structure for the fast radar cross section (RCS) prediction of electrically large and complex targets. The multiresolution grid algorithm can greatly reduce the total number of ray tubes, as it adaptively adjusts the density of ray tubes for regions with different complexities o...
متن کاملDe-tree Ray Tracing and Box-query Performance Data
Tables 1 and 2 below include performance data of the new ray shooting algorithm (RSA) called the DE-tree. The data is from rendering the standard procedural database (SPD) scenes. This data structure is in part of interest because it achieves efficiency in the four major performance metrics of robustness, search speed, memory usage, and RSA build time. Simultaneously achiving these goals is hig...
متن کاملImproving Memory Space Efficiency of Kd-tree for Real-time Ray Tracing
Compared with its competitors such as the bounding volume hierarchy, a drawback of the kd-tree structure is that a large number of triangles are repeatedly duplicated during its construction, which often leads to inefficient, large and tall binary trees with high triangle redundancy. In this paper, we propose a space-efficient kd-tree representation where, unlike commonly used methods, an inner...
متن کاملOctrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applications, e.g., radio propagation simulation. Aronov and Fortune were the first to guarantee an overall performance within a constant factor of optimal in the following model of computation: build a triangulation compatib...
متن کامل